A construction of maximally recoverable codes
نویسندگان
چکیده
We construct a family of linear maximally recoverable codes with locality $r$ and dimension $r+1.$ For length $n$ $r\approx n^\alpha, 0\le\alpha\le 1$ the code alphabet is order $n^{1+3\alpha},$ which improves upon previously known constructions codes.
منابع مشابه
On Maximally Recoverable Codes for Product Topologies
Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct all erasure patterns that are information-theoretically correctable. In a grid-like topology, there are a local constraints in every column forming a column code, b local constraints in every row forming a row code, and h global constraints in an (m × n) grid of codeword. Recently, Gopalan et al. ...
متن کاملOn Maximally Recoverable Local Reconstruction Codes
In recent years the explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Local Reconstruction Codes (LRCs) have emerged as the codes of choice for these applications. An (n, r ,h,a,q)-LRC is a q-ary code, where encoding is as a two stage process. In the first stage, h redundant parity symbols are generate...
متن کاملMaximally Recoverable Codes for Grid-like Topologies
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we view as the main coding theoretic barrier to deploying longer codes in storage: at large lengths, failures are not independent and correlated failures are i...
متن کاملA Complete Classification of Partial-MDS (Maximally Recoverable) Codes with One Global Parity
Partial-MDS (PMDS) codes are a family of locally repairable codes, mainly used for distributed storage. They are defined to be able to correct any pattern of s additional erasures, after a given number of erasures per locality group have occurred. This makes them also maximally recoverable (MR) codes, another class of locally repairable codes. Both terms will be properly defined in the next sec...
متن کاملCommunication Cost for Updating Functions when Message Updates are Sparse: Connections to Maximally Recoverable Codes
We consider a communication problem in which an update of the source message needs to be conveyed to one or more distant receivers that are interested in maintaining specific linear functions of the source message. The setting is one in which the updates are sparse in nature, and where neither the source nor the receiver(s) is aware of the exact difference vector, but only know the amount of sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2022
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-022-01020-8